<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>6qtX3pFwXQZeBBx/wpAPK</identifier>
		<repository>sid.inpe.br/banon/2002/12.09.10.27</repository>
		<lastupdate>2002:11.28.02.00.00 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/banon/2002/12.09.10.27.33</metadatarepository>
		<metadatalastupdate>2022:06.14.00.12.32 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2001}</metadatalastupdate>
		<doi>10.1109/SIBGRAPI.2001.963077</doi>
		<citationkey>OliveiraBenSabBorSue:2001:FeSuSe</citationkey>
		<title>Feature subset selection using genetic algorithms for handwritten digit recognition</title>
		<year>2001</year>
		<numberoffiles>1</numberoffiles>
		<size>605 KiB</size>
		<author>Oliveira, L. S.,</author>
		<author>Benahmed, N.,</author>
		<author>Sabourin,  R.,</author>
		<author>Bortolozzi, F.,</author>
		<author>Suen, C. Y.,</author>
		<editor>Borges, Leandro Díbio,</editor>
		<editor>Wu, Shin-Ting,</editor>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 14 (SIBGRAPI)</conferencename>
		<conferencelocation>Florianópolis, SC, Brazil</conferencelocation>
		<date>15-18 Oct. 2001</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<pages>362-369</pages>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<organization>SBC - Brazilian Computer Society</organization>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<keywords>feature subset selection, genetic algorithms, handwritten digit recognition.</keywords>
		<abstract>In this paper two approaches of genetic algorithm for feature subset selection are compared. The first approach considers a simple genetic algorithm (SGA) while the second one takes into account an iterative genetic algorithm (IGA) which is claimed to converge faster than SGA. Initially, we present an overview of the system to be optimized and the methodology applied in the experiments as well. Afterwards we discuss the advantages and drawbacks of each approach based on the experiments carried out on NIST SD19. Finally, we conclude that the IGA converges faster than the SGA, however, the SGA seems more suitable for our problem.</abstract>
		<language>en</language>
		<targetfile>362-369.pdf</targetfile>
		<usergroup>administrator</usergroup>
		<visibility>shown</visibility>
		<nexthigherunit>8JMKD3MGPEW34M/46Q6TJ5</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/04.29.19.35 9</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<notes>The conference was held in Florianópolis, SC, Brazil, from October 15 to 18.</notes>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/banon/2002/12.09.10.27</url>
	</metadata>
</metadatalist>